- multiplication scheme
- схема f умножения
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
multiplication scheme
Смотреть что такое "multiplication scheme" в других словарях:
Multiplication algorithm — A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use. Efficient multiplication algorithms have existed since the advent of the decimal system.… … Wikipedia
Horner scheme — In numerical analysis, the Horner scheme or Horner algorithm, named after William George Horner, is an algorithm for the efficient evaluation of polynomials in monomial form. Horner s method describes a manual process by which one may approximate … Wikipedia
Group scheme — In mathematics, a group scheme is a group object in the category of schemes. That is, it is a scheme G with the equivalent properties* there is a group law expressible as a multiplication μ and inversion map ι on G ; or * G is a functor (as in… … Wikipedia
Booth's multiplication algorithm — is a multiplication algorithm that multiplies two signed binary numbers in two s complement notation.ProcedureBooth s algorithm involves repeatedly adding one of two predetermined values A and S to a product P , then performing a rightward… … Wikipedia
Force multiplication — Force multiplication, in military usage, refers to an attribute or a combination of attributes which make a given force more effective than that same force would be without it. The expected size increase required to have the same effectiveness… … Wikipedia
Formal scheme — In mathematics, specifically in algebraic geometry, a formal scheme is a type of space which includes data about its surroundings. Unlike an ordinary scheme, a formal scheme includes infinitesimal data that, in effect, points in a direction off… … Wikipedia
Paul G. Comba — Minor planets discovered: 498 7684 Marioferrero March 3, 1997 8223 Bradshaw August 6, 1996 8224 Fultonwright August 6, 1996 8407 Houlahan July 25, 1995 8420 Angrogna November 1 … Wikipedia
mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… … Universalium
Elliptic curve cryptography — (ECC) is an approach to public key cryptography based on the algebraic structure of elliptic curves over finite fields. The use of elliptic curves in cryptography was suggested independently by Neal Koblitz[1] and Victor S. Miller[2] in 1985.… … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Second-order arithmetic — In mathematical logic, second order arithmetic is a collection of axiomatic systems that formalize the natural numbers and sets thereof. It is an alternative to axiomatic set theory as a foundation for much, but not all, of mathematics. The… … Wikipedia
